| 翻訳と辞書 |
| rencontres numbers ： ウィキペディア英語版 |
rencontres numbers
In combinatorial mathematics, the rencontres numbers are a triangular array of integers that enumerate permutations of the set with specified numbers of fixed points: in other words, partial derangements. (''Rencontre'' is French for ''encounter''. By some accounts, the problem is named after a solitaire game.) For ''n'' ≥ 0 and 0 ≤ ''k'' ≤ ''n'', the rencontres number ''D''''n'', ''k'' is the number of permutations of that have exactly ''k'' fixed points.
For example, if seven presents are given to seven different people, but only two are destined to get the right present, there are ''D''7, 2 = 924 ways this could happen. Another often cited example is that of a dance school with 7 couples, where after tea-break the participants are told to ''randomly'' find a partner to continue, and there are ''D''7, 2 = 924 possibilities once more, now, that 2 previous couples meet again just by chance.
== Numerical values ==
Here is the beginning of this array :
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「rencontres numbers」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|